Scheduling in Instantaneous-Interference-Limited CR Networks with Delay Guarantees
نویسندگان
چکیده
We study an uplink multi secondary user (SU) cognitive radio system having average delay constraints as well as an instantaneous interference constraint to the primary user (PU). If the interference channels from the SUs to the PU have independent but not identically distributed fading coefficients, then the SUs will experience heterogeneous delay performances. This is because SUs causing low interference to the PU will be scheduled more frequently, and/or allocated more transmission power than those causing high interference. We propose a dynamic scheduling-and-power-control algorithm that can provide the required average delay guarantees to all SUs as well as protecting the PU from interference. Using the Lyapunov technique, we show that our algorithm is asymptotically delay optimal while satisfying the delay and interference constraints. We support our findings by extensive system simulations and show the robustness of the proposed algorithm against channel estimation errors.
منابع مشابه
Scheduling Algorithms for Arbitrary Communication Networks
We consider the problem of designing scheduling schemes for networks with arbitrary topology and scheduling constraints. We address the optimality of scheduling schemes for packet networks in terms of throughput, delay and fairness. Specifically, we design two scheduling schemes. The first one achieves simultaneous throughput and delay optimization. The second scheme provides fairness. We desig...
متن کاملPractical scheduling schemes with throughput guarantees for multi-hop wireless networks
In wireless communication systems, the interference between links results in a challenging scheduling problem. A K-hop interference model is defined as one for which no two links within K-hops can successfully transmit at the same time (note that IEEE 802.11 DCF corresponds to a 2-hop interference model). For a given K, a throughput-optimal scheduler needs to solve a maximum weighted matching p...
متن کاملEfficient link scheduling for online admission control of real-time traffic in wireless mesh networks
Link scheduling is used in Wireless Mesh Networks (WMNs) to guarantee interference-free transmission on the shared wireless medium in a Time Division Multiple Access approach. Several papers in the literature address the problem of link scheduling guaranteeing a minimum throughput to the flows traversing the WMN. However, none of the existing works address the problem of computing a schedule th...
متن کاملAchieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks
We address the question of attaining stability guarantees through distributed scheduling in wireless networks. We consider a simple, local information based, distributed scheduling strategy, maximal scheduling, and prove that it attains a guaranteed fraction of the maximum stability region. By considering the notion of queue-length stability, we strengthen existing rate stability results for ma...
متن کاملMulti-Queue Management and Scheduling for Improved QoS in Communication Networks
Quality of Service (QoS) and gigabit networking are the new dimensions that modern VLSI technology is bringing into communications, today. Highly-integrated building block components are the key in bringing this new technology to the users at low cost. Based on OMI-developed HIC/HS gigabit links, we are developing two such components. ATLAS I, a 20 Gbps single-chip ATM switch is being implement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1512.02989 شماره
صفحات -
تاریخ انتشار 2015